Tolerance orders and bipartite unit tolerance graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tolerance Graphs and Orders

We show that if a tolerance graph is the complement of a comparability graph it is a trapezoid graph, i.e., the complement of an order of interval dimension at most 2. As consequences we are able to give obstructions for the class of bounded tolerance graphs and to give an example of a graph which is alternatingly orientable but not a tolerance graph. We also characterize the tolerance graphs a...

متن کامل

Proper and Unit Tolerance Graphs

We answer a question of Golumbic, Monma and Trotter by constructing proper tolerance graphs that are not unit tolerance graphs. An infinite family of graphs that are minimal in this respect is specified.

متن کامل

Recognizing Bipartite Unbounded Tolerance Graphs in Linear Time

A graph G = (V,E) is a tolerance graph if each vertex v ∈ V can be associated with an interval of the real line Iv and a positive real number tv in such a way that (uv) ∈ E if and only if |Iv ∩ Iu| ≥ min(tv, tu). No algorithm for recognizing tolerance graphs in general is known. In this paper we present an O(n+m) algorithm for recognizing tolerance graphs that are also bipartite, where n and m ...

متن کامل

Pre-Orders for Fault Tolerance

We describe a process algebraic approach to the semantics of robust systems. We extend a subset of CCS [14] with multi-set pre xes to model systems with replicated synchronous majority voting. Based on an operational semantics, we de ne pre-orders which introduces a hierarchy of faulty processes and fault-tolerant processes. We then show how a similar ordering on modalformulae [18] can characte...

متن کامل

Tolerance graphs

Tolerance graphs arise from the intersection of intervals with varying tolerances in a way that generalizes both interval graphs and permutation graphs. In this paper we prove that every tolerance graph is perfect by demonstrating that its complement is perfectly orderable. We show that a tolerance graph cannot contain a chordless cycle of length greater than or equal to 5 nor the complement of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2001

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(00)00124-2